Importance Sampling Embedded Experimental Frame Design for Efficient Monte Carlo Simulation
نویسندگان
چکیده
منابع مشابه
Efficient Importance Sampling for Monte Carlo Simulation of Multicast Networks
We consider the problem of estimating blocking probabilities in a multicast loss system via simulation, applying the static Monte Carlo method with importance sampling. An approach is introduced where the original estimation problem is first decomposed into independent simpler sub-problems, each roughly corresponding to estimating the blocking probability contribution from a single link. Then w...
متن کاملAdaptive importance sampling Monte Carlo simulation of rare transition events.
We develop a general theoretical framework for the recently proposed importance sampling method for enhancing the efficiency of rare-event simulations [W. Cai, M. H. Kalos, M. de Koning, and V. V. Bulatov, Phys. Rev. E 66, 046703 (2002)], and discuss practical aspects of its application. We define the success/fail ensemble of all possible successful and failed transition paths of any duration a...
متن کاملDesign of Sparse Linear Arrays by Monte Carlo Importance Sampling
The formation of acoustic images in real-time requires an enormous computational burden. To reduce this demand the use of sparse arrays for beamforming is mandated. The design of these arrays for adequate mainlobe width and low sidelobe level is a difficult nonlinear optimization problem. A new approach to the joint optimization of sensor placement and shading weights is discussed. Based on the...
متن کاملIrreversible Monte Carlo Algorithms for Efficient Sampling
Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is sufficient but not necessary. We construct irreversible deformation of a given reversible algorithm capable of dramatic improvement of sampling from known dist...
متن کاملMonte Carlo inference via greedy importance sampling
We present a new method for conducting Monte Carlo inference in graphical models which combines explicit search with generalized importance sampling. The idea is to reduce the variance of importance sampling by searching for significant points in the target distribution. We prove that it is possible to introduce search and still maintain unbiasedness. We then demonstrate our procedure on a few ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2013
ISSN: 1598-4877
DOI: 10.5392/jkca.2013.13.04.053